440B - Balancer - CodeForces Solution


greedy implementation *1600

Please click on ads to support us..

C++ Code:

#include <iostream>
#define int long long
using namespace std;

signed main() {
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	int n, k = 0;
	cin >> n;
	int a[n], ans = 0;
	for (int &i : a) cin >> i, k += i;
	k /= n;
	for (int i = 1, m; i < n; i++) {
		m = k - a[i - 1];
		a[i - 1] += m, a[i] -= m;
		ans += abs(m);
	}
	cout << ans;
	return 0;
}


Comments

Submit
0 Comments
More Questions

855A - Tom Riddle's Diary
1417A - Copy-paste
1038A - Equality
1061A - Coins
1676E - Eating Queries
1447A - Add Candies
1721D - Maximum AND
363C - Fixing Typos
1401A - Distance and Axis
658A - Bear and Reverse Radewoosh
1721E - Prefix Function Queries
977E - Cyclic Components
1140D - Minimum Triangulation
75C - Modified GCD
1722A - Spell Check
1722B - Colourblindness
1722D - Line
1722C - Word Game
1722G - Even-Odd XOR
552E - Vanya and Brackets
933A - A Twisty Movement
1722F - L-shapes
1196B - Odd Sum Segments
1325D - Ehab the Xorcist
552B - Vanya and Books
1722E - Counting Rectangles
168A - Wizards and Demonstration
168B - Wizards and Minimal Spell
7A - Kalevitch and Chess
912B - New Year's Eve